Using Attributed Flow Graph Parsing to Recognize Clichés in Programs

نویسنده

  • Linda M. Wills
چکیده

This paper presents a graph parsing approach to recognizing common stereotypical computational structures called clich es in com puter programs Recognition is a powerful technique for e ciently recon structing useful design information from existing software We use a ow graph formalism which is closely related to hypergraph formalisms to represent programs and clich es and we use attributed ow graph parsing to automate recognition The formalism includes mechanisms for toler ating variations in programs due to structure sharing a common opti mization in which a structural component is used to play more than one functional role The formalism has also been designed to capture aggre gation relationships on graph edges which is used to encode aggregate data structure clich es and the abstract operations on them A chart pars ing algorithm is used to solve the problem of determining which clich es in a given clich e library are in a given program

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Attributed Flow Graph Parsing to Recognize Clich Es in Programs 1 Program Recognition

This paper presents a graph parsing approach to recognizing common, stereotypical computational structures, called clich es, in computer programs. Recognition is a powerful technique for eeciently reconstructing useful design information from existing software. We use a ow graph formalism, which is closely related to hypergraph formalisms, to represent programs and clich es and we use attribute...

متن کامل

HRNCE Grammars - A Hypergraph Generating System with an eNCE Way

Software Integration Problems and Coupling of Graph Grammar Specifications p. 155 Using Attributed Flow Graph Parsing to Recognize Cliches in Programs p. 170 Reconfiguration Graph Grammar for Massively Parallel, Fault Tolerant Computers p. 185 The Use of Tree Transducers to Compute Translations Between Graph Algebras p. 196 The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars p. 2...

متن کامل

An improved joint model: POS tagging and dependency parsing

Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...

متن کامل

A Heuristic Driven Chart-Parser for Attributed Node Labeled Graph Grammars and its Application to Feature Recognition in CIM

To integrate CA*-systems with other applications in the CIM world, one principal approach currently under development is the feature recognition process based on graph grammars. It enables any CIM component to recognize the higher-level entities the so-called features used in this component out of a lower-data exchange format, which might be the internal representation of a CAD system as well a...

متن کامل

Hidden Markov model parsing of video programs

This paper introduces statistical parsing of video programs using hidden Markov models (HMMs). The fundamental units of a video program are shots and transitions (fades, dissolves, etc.). Those units are in turn used to create more complex structures, such as scenes. Parsing a video allows us to recognize higher-level story abstractions—dialog sequences, transitional scenes, etc. These higher-l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994